Circuits with arbitrary gates for random operators
نویسندگان
چکیده
We consider boolean circuits computing n-operators f : {0, 1} n → {0, 1} n. As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operator is linear if it computes n linear forms, that is, computes a matrix-vector product A x over GF (2). We prove the existence of n-operators requiring about n 2 wires in any circuit, and linear n-operators requiring about n 2 / log n wires in depth-2 circuits, if either all output gates or all gates on the middle layer are linear.
منابع مشابه
A Minimal-Cost Inherent-Feedback Approach for Low-Power MRF-Based Logic Gates
The Markov random field (MRF) theory has been accepted as a highly effective framework for designing noise-tolerant nanometer digital VLSI circuits. In MRF-based design, proper feedback lines are used to control noise and keep the circuits in their valid states. However, this methodology has encountered two major problems that have limited the application of highly noise immune MRF-based circui...
متن کاملA Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کاملCan Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ?
For ordinary circuits with a xed upper bound on the maximal fanin of gates it has been shown that logarithmic redundancy is necessary and suucient to overcome random hardware faults. Here, we consider the same question for unbounded fanin circuits that in the noiseless case can compute Boolean functions in sublogarithmic depth. In this case the details of the fault model become more important. ...
متن کاملAsymptotically optimal circuits for arbitrary n-qubit diagonal comutations
A unitary operator U = ∑ j,k u j,k|k〉〈 j| is called diagonal when u j,k = 0 unless j = k. The definition extends to quantum computations, where j and k vary over the 2n binary expressions for integers 0,1 · · · ,2n−1, given n qubits. Such operators do not affect outcomes of the projective measurement {〈 j| ; 0 ≤ j ≤ 2n − 1} but rather create arbitrary relative phases among the computational bas...
متن کاملA New Circuit Scheme for Wide Dynamic Circuits
In this paper, a new circuit scheme is proposed to reduce the power consumption of dynamic circuits. In the proposed circuit, an NMOS keeper transistor is used to maintain the voltage level in the output node against charge sharing, leakage current and noise sources. Using the proposed keeper scheme, the voltage swing on the dynamic node is lowered to reduce the power consumption of wide fan-in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1004.5236 شماره
صفحات -
تاریخ انتشار 2010